Three-dimensional Medical Image Segmentation Using a Graph-Theoretic Energy-Minimisation Approach

نویسنده

  • Brian Parker
چکیده

A new graph algorithm for multiscale segmentation of threedimensional medical data sets is presented. It is a threedimensional generalisation of an existing two-dimensional Mumford-Shah region-merging segmentation algorithm. The Mumford-Shah functional formulation leads to improved segmentation results compared to alternative approaches; the graph theoretic approach yields improved performance and simplified data structures; and the automated stopping estimation allows a fully non-supervised algorithm with no tuning parameters required (except for an optional parameter to select the depth of segmentation).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic foreground extraction via joint CRF and online learning

A novel approach is proposed for automatic foreground extraction which aims to segment out all foreground objects from the background in the image. The segmentation problem is formulated as an iterative energy minimisation of the conditional random field (CRF), which can be efficiently optimised by graph-cuts. The energy minimisation is initialised and modulated by a soft location map predicted...

متن کامل

Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

متن کامل

Optimal Graph Search Segmentation Using Arc-Weighted Graph for Simultaneous Surface Detection of Bladder and Prostate

We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic approach. Hard surface interacting constraints are enforced in the interacting regions, preserving the geometric relationship of those partially interacting surfaces. The soft smoothness a priori shape compliance is in...

متن کامل

Graph Cut Matching In Computer Vision

Introduction Many of the problems that arise in early vision can be naturally expressed in terms of energy minimization. For example, a large number of computer vision problems attempt to assign labels (such as intensity, disparity, segmentation regions) to pixels based on noisy measurements. In the presence of these uncertainties, finding the best labelling may therefore be seen as an optimiza...

متن کامل

Multi-Atlas Segmentation using Partially Annotated Data: Methods and Annotation Strategies

Multi-atlas segmentation is a widely used tool in medical image analysis, providing robust and accurate results by learning from annotated atlas datasets. However, the availability of fully annotated atlas images for training is limited due to the time required for the labelling task. Segmentation methods requiring only a proportion of each atlas image to be labelled could therefore reduce the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001